package com.zklh.leetcode.dynamic.easy.problem121;

/**
 * @ClassName Solution
 * @Description
 * @Author 坐看落花
 * @Date 2020/4/10 15:35
 * @Version 1.0
 **/
public class Solution {
    public int maxProfit(int[] prices) {
       return 0;
    }
}
